A Method for Evaluating Upper Bound of Simultaneous Switching Gates Using Circuit Partition
نویسندگان
چکیده
This paper presents a method for evaluating an upper bound of simultaneous switching gates in combinational circuits. In this method, the original circuit is partitioned into subcircuits, and the upper bound is approximately computed as the sum of maximum switching gates for all subcircuits. In order to increase the accuracy, we adopted an evaluation function that takes account of both the interconnections among subcircuits and the number of generated subcircuits. Experimental results for ISCAS circuits show that the method efficiently evaluates the upper bounds of switching gates.
منابع مشابه
Lecture 5: Razborov-Smolensky Lower Bounds for Constant-Depth Circuit with MODp Gates
In this lecture, we will talk about circuit lower bound for constant-depth circuit with MODp gates. Using switching lemma, we can prove exponential size lower bound for constant-depth circuit computing parity and majority. What if parity (=MOD2 gates) are allowed? It was conjectured that majority still needs exponential size to compute in constant-depth circuit. Razborov (1987) solves this conj...
متن کاملRectification in Graphene Self-Switching Nanodiode Using Side Gates Doping
The electrical properties and rectification behavior of the graphene self-switching diodes by side gates doping with nitrogen and boron atoms were investigated using density functional tight-binding method. The devices gates doping changes the electrical conductivity of the side gates and the semiconductor channel nanoribbons. As a result, the threshold voltage value under the forward bias is s...
متن کاملBounding of Switching Activity in Logic Circuits
Electronic systems became an essential component of our lives. The demand for increased functionality is satisfied by higher integration which, however, make the design process more complex and introduces new problems. These problems must be considered in every step involved in the design of electronic systems. One of these steps is verification checking, whether what is manufactured will work ...
متن کاملNew results on upper domatic number of graphs
For a graph $G = (V, E)$, a partition $pi = {V_1,$ $V_2,$ $ldots,$ $V_k}$ of the vertex set $V$ is an textit{upper domatic partition} if $V_i$ dominates $V_j$ or $V_j$ dominates $V_i$ or both for every $V_i, V_j in pi$, whenever $i neq j$. The textit{upper domatic number} $D(G)$ is the maximum order of an upper domatic partition. We study the properties of upper domatic number and propose an up...
متن کاملA New Circuit Scheme for Wide Dynamic Circuits
In this paper, a new circuit scheme is proposed to reduce the power consumption of dynamic circuits. In the proposed circuit, an NMOS keeper transistor is used to maintain the voltage level in the output node against charge sharing, leakage current and noise sources. Using the proposed keeper scheme, the voltage swing on the dynamic node is lowered to reduce the power consumption of wide fan-in...
متن کامل